2 00 0 Three Weight Systems Arising from Intersection Graphs
نویسنده
چکیده
We describe three weight systems arising from the intersection graphs of chord diagrams (also known as circle graphs). These derive from the determinant and rank of the adjacency matrix of the graph, viewed over Z 2 , and from the rank of a " marked " adjacency matrix. We show that these weight systems are exactly those given by the Conway, HOMFLYPT and Kauffman polynomials, respectively.
منابع مشابه
A Few Weight Systems Arising from Intersection Graphs
We show that the adjacency matrices of the intersection graphs of chord diagrams satisfy the 2-term relations of Bar-Natan and Garoufalides [2], and hence give rise to weight systems. Among these weight systems are those associated with the Conway and HOMFLYPT polynomials. We extend these ideas to looking at a space of marked chord diagrams modulo an extended set of 2-term relations, define a s...
متن کاملSome lower bounds for the $L$-intersection number of graphs
For a set of non-negative integers~$L$, the $L$-intersection number of a graph is the smallest number~$l$ for which there is an assignment of subsets $A_v subseteq {1,dots, l}$ to vertices $v$, such that every two vertices $u,v$ are adjacent if and only if $|A_u cap A_v|in L$. The bipartite $L$-intersection number is defined similarly when the conditions are considered only for the ver...
متن کاملIntersection Graphs for String Links
We extend the notion of intersection graphs for knots in the theory of finite type invariants to string links. We use our definition to develop weight systems for string links via the adjacency matrix of the intersection graphs, and show that these weight systems are related to the weight systems induced by the Conway and Homfly polynomials.
متن کاملStable 2-pairs and (X, Y)-intersection graphs
1 Stable 2-Pairs and (X; Y)-Intersection Graphs 2 Abstract Given two xed graphs X and Y , the (X; Y)-intersection graph of a graph G is a graph where 1. each vertex corresponds to a distinct induced subgraph in G that is iso-morphic to Y , and 2. two vertices are adjacent ii the intersection of their corresponding sub-graphs contains an induced subgraph isomorphic to X. This notion generalizes ...
متن کاملColouring triangle-free intersection graphs of boxes on the plane
We prove that intersection graphs of boxes on the plane with girth 6 and 8 are 3and 2-degenerate, respectively. This implies that these graphs are 4and 3-list-colourable, respectively. c © 2000 Published by Elsevier Science B.V. All rights reserved.
متن کامل